An optimal dissipative encoder for the toric code
نویسندگان
چکیده
منابع مشابه
an investigation about the appropriate stochastic modeling framework for agricultural insurance pricing
با توجه به اینکه بیمه محصولات کشاورزی در ایران بیشتر جنبه ای حمایتی دارد و خسارات گزارش شده عموما بیش از حق بیمه های دریافت شده است، در این پایان نامه به جهت تعیین قیمت بیمه محصولات کشاورزی (گندم دیم) از فرآیندهای نوفه شلیک به عنوان مدلی مناسب استفاده شده است. بر اساس داده های صندوق بیمه کشاورزی از خسارات اعلام شده در سال زراعی 1388-1389 گندم دیم، در این پایان نامه حق بیمه خالص و ناخالص این محص...
Localization assisted quantum error correction in the toric code
Topological quantum error correcting codes are unique. Their non-trivial syndromes can be interpreted as quasiparticles, and logical errors correspond to the propagation of these in topologically non-trivial loops. Hence, to a much greater extent than other error correcting codes, a wealth of techniques from physics may be applied to understand the topological codes and enhance their power. Her...
متن کاملMATLAB CODE FOR AN ENHANCED VIBRATING PARTICLES SYSTEM ALGORITHM
Vibrating particles system (VPS) is a new meta-heuristic algorithm based on the free vibration of freedom system’ single degree with viscous damping. In this algorithm, each agent gradually approach to its equilibrium position; new agents are generated according to current agents and a historically best position. Enhanced vibrating particles system (EVPS) employs a new alternative procedu...
متن کاملEarly fixation of an optimal genetic code.
The evolutionary forces that produced the canonical genetic code before the last universal ancestor remain obscure. One hypothesis is that the arrangement of amino acid/codon assignments results from selection to minimize the effects of errors (e.g., mistranslation and mutation) on resulting proteins. If amino acid similarity is measured as polarity, the canonical code does indeed outperform mo...
متن کاملAn Optimal Strongly Identifying Code in the Infinite Triangular Grid
Assume that G = (V,E) is an undirected graph, and C ⊆ V . For every v ∈ V , we denote by I(v) the set of all elements of C that are within distance one from v. If the sets I(v) \ {v} for v ∈ V are all nonempty, and, moreover, the sets {I(v), I(v) \ {v}} for v ∈ V are disjoint, then C is called a strongly identifying code. The smallest possible density of a strongly identifying code in the infin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2014
ISSN: 1367-2630
DOI: 10.1088/1367-2630/16/1/013023